The positive maximum principle on symmetric spaces
نویسندگان
چکیده
منابع مشابه
Deconvolution Density Estimation on Spaces of Positive Definite Symmetric Matrices
Motivated by applications in microwave engineering and diffusion tensor imaging, we study the problem of deconvolution density estimation on the space of positive definite symmetric matrices. We develop a nonparametric estimator for the density function of a random sample of positive definite matrices. Our estimator is based on the Helgason-Fourier transform and its inversion, the natural tools...
متن کاملGeneralized Symmetric Berwald Spaces
In this paper we study generalized symmetric Berwald spaces. We show that if a Berwald space $(M,F)$ admits a parallel $s-$structure then it is locally symmetric. For a complete Berwald space which admits a parallel s-structure we show that if the flag curvature of $(M,F)$ is everywhere nonzero, then $F$ is Riemannian.
متن کاملThe Uncertainty Principle on Riemannian Symmetric Spaces of the Noncompact Type
The uncertainty principle in Rn says that it is impossible for a function and its Fourier transform to be simultaneously very rapidly decreasing. A quantitative assertion of this principle is Hardy’s theorem. In this article we prove various generalisations of Hardy’s theorem for Riemannian symmetric spaces of the noncompact type. In the case of the real line these results were obtained by Morg...
متن کاملThe Pontryagin Maximum Principle
Theorem (PontryaginMaximum Principle). Suppose a final time T and controlstate pair (û, x̂) on [τ, T ] give the minimum in the problem above; assume that û is piecewise continuous. Then there exist a vector of Lagrange multipliers (λ0, λ) ∈ R × R with λ0 ≥ 0 and a piecewise smooth function p: [τ, T ] → R n such that the function ĥ(t) def =H(t, x̂(t), p(t), û(t)) is piecewise smooth, and one has ̇̂ ...
متن کاملThe Strong Maximum Principle on Infinite Networks
We study the strong maximum principle for the heat equation associated with the Dirichlet form on an infinite network. We prove that the strong maximum principle is equivalent to the underlying graph being connected after deletion of the nodes with infinite degree. Using this result, we prove that the multiplicity of the eigenvalue 0 of a generalization of the Laplace matrix equals the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Positivity
سال: 2020
ISSN: 1385-1292,1572-9281
DOI: 10.1007/s11117-020-00746-w